Error-bounded and Number-bounded Approximate Spatial Query for Interactive Visualization
نویسندگان
چکیده
منابع مشابه
Bounded-Error Interactive Ray Tracing
Ray tracing, which computes radiance, is traditionally regarded as an off-line rendering algorithm that is too slow for interactive use. In this paper, we present an interactive system that uses 4D interpolants to approximate radiance, while providing guaranteed error bounds. Our system exploits the object-space, ray-space, image-space and temporal coherence in radiance to accelerate ray tracin...
متن کاملBounded Approximate Character Amenability of Banach Algebras
The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...
متن کاملApproximate Bounded Indistinguishability
Two distributions over n-bit strings are (k, δ)-wise indistinguishable if no statistical test that observes k of the n bits can tell the two distributions apart with advantage better than δ. Motivated by secret sharing and cryptographic leakage resilience, we study the existence of pairs of distributions that are (k, δ)-wise indistinguishable, but can be distinguished by some function f of suit...
متن کاملSpace-Bounded Query Approximation
When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q,...
متن کاملQuantum Bounded Query Complexity
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Geosciences
سال: 2018
ISSN: 2391-5447
DOI: 10.1515/geo-2018-0039